Tasks Decomposition Problem in Multi

We consider a synthesis of complex objects by multi-agent system based on rough mereology theory 12]. Any agent can produce complex objects from parts obtained from his sub-agents using some composition rules. Agents are equipped with decision tables describing partial speciications of their synthesis tasks. We investigate some problems of searching for optimal task speciications for sub-agents having task spec-iication for a super-agent. We propose a decomposition scheme (based on rough set and rough mereology theory) consistent with given composition rules. The computational complexity of decomposition problems is discussed by showing that these problems are equivalent to some well known graph theory problems.We also propose some heuristics for considered problems. As an application of multi-agent system we will show an eeective decomposition and synthesis scheme for a production process of complex objects. We will show an upper bound of an error rate in synthesis process of our system. This paper is an extension of 8]. In 8] we have assumed that a speciication of an operation performed by a given agent is represented as a decision table and the decomposition was performed using directly this table. Here we rst compute the decision rules from the decision table and the decomposition is performed using these rules. Hence, the decomposition is based on a generalization of initial knowledge represented by decision table.